Simple 0/1-Polytopes
نویسندگان
چکیده
For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very di erent within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a conjecture of Ziegler), and thus, the restriction to simple 0/1-polytopes leaves only a very small class of objects with a rather trivial structure.
منابع مشابه
Linear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملar X iv : 0 70 9 . 20 99 v 1 [ m at h . M G ] 1 3 Se p 20 07 Representing Simple d - Dimensional Polytopes by d Polynomials ∗
A polynomial representation of a convex d-polytope P is a finite set {p1(x),. .. , pn(x)} of poly-nomials over R d such that P = ˘ x ∈ R d : p1(x) ≥ 0 for every 1 ≤ i ≤ n ¯. By s(d, P) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d ≤ s(d, P) ≤ 2d − 1. Moreover, it is conjectured that s(d, P) = d for all convex d-polytopes P. We confirm...
متن کاملLectures on 0/1-Polytopes
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an introduction and invitation. Rather than heading for an extensive survey on 0/1polytopes I present some interesting aspects of these objects; all of them are related to some quite recent work and progress. 0/1-polytopes have a very simple definition and explicit descriptions; we can enumerate and analyze small exa...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملRepresenting simple d-dimensional polytopes by d polynomials
A polynomial representation of a convex d-polytope P is a finite set {p1(x), . . . , pn(x)} of polynomials over R such that P = ̆ x ∈ R : p1(x) ≥ 0 for every 1 ≤ i ≤ n ̄ . By s(d, P ) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d ≤ s(d, P ) ≤ 2d − 1. Moreover, it is conjectured that s(d, P ) = d for all convex d-polytopes P. We confirm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2000